13 research outputs found

    Survey on Secure Mining of Association Rules in Vertically Distributed Databases

    Get PDF
    A distributed database system is a collection of sites connected on a common high bandwidth network. Logically, data belongs to the same system but physically it is spread over the sites of the network, making the distribution invisible to the user. The advantage of this distribution resides in achieving availability, performance, modularity and reliability. In this paper, I have done a survey of papers related to Mining of Association Rules over distributed databases. From this survey, we have come up with a proposed solution to address the problem of secure mining of association rules where transactions are distributed in vertically distributed databases. Each site holds some attributes of each transaction and the sites wish to participate in the identification of globally valid association rules However, the sites should not reveal individual transaction data. The Protocol is based on Apriori Algorithm [2] and MultiParty Algorithm [3] for efficiently discovering frequent item sets with minimum support levels, without either site communicating individual transaction values. DOI: 10.17762/ijritcc2321-8169.15035

    Mining and Clustering of Location Based Services on Basis of Moving Transactions

    Get PDF
    ABSTRACT: In today's world everything is fast paced and internet as become necessity of life we need it at every step. With the invention of smart phone GPS enabled cell user can ask for any service via Information service and Application provider from anywhere any time. This business model is known as moving commerce .It provides Location based services through moving phone. One of the active topics in mining is the mining and prediction of moving movements and associated transactions. Most of existing studies focus on discovering moving patterns from the whole logs. The issue with this method is that it does not provide accurate information as it depends on spatial clustering where as Location based services require non spatial clustering. The other issue with it is that most methods requires user to set the parameters which is highly impossible in an active environment. Moreover in moving environment the user profiles are seldom known but what we know is the moving transaction patterns. In the paper we will use an algorithm, namely, Temporal Moving Sequential Pattern Mine based on clustering, to discover the Cluster-based Temporal Moving Sequential Patterns .User clusters are constructed by a algorithm named ClusterObject-based Smart Cluster Affinity Search Technique similarities between users are evaluated by the proposed measure, Location-Based Service Alignment (LBS-Alignment).In the algorithm is also proposed to use time as also one of the dimensions where similar moving characteristics exist

    EFFICIENT ALLOCATION OF DYNAMIC RESOURCES IN A CLOUD

    Get PDF
    ABSTRACT: In recent years ad hoc parallel data processing has emerged to be one of the killer applications for Infrastructure-as-a-Service (IaaS ) clouds. Major Cloud computing companies have started to integrate frameworks for parallel data processing in their product portfolio, making it easy for customers to access these services and to deploy their programs. The opportunities and challenges for efficient parallel data processing in clouds are discussed and present the research project Nephele. It is the first data processing framework to explicitly exploit the dynamic resource allocation offered by today's IaaS clouds for both, task scheduling a nd execution. Particular tasks of a processing job can be assigned to different types of virtual machines which are automatically instantiated and terminated during the job execution. Based on this new framework, the extended evaluations of MapReduce -inspired processing jobs on an IaaS cloud system is performed and compared the results to the popular data processing framework Hadoop

    Performance Evaluation of Multimedia Content Distribution over Multi-Homed Wireless Networks

    Get PDF
    ABSTRACT-The growing availability of IP based heterogeneous wireless access technologies coupled with the increasing capabilities of mobile devices is creating opportunities for multimedia distribution. Through its multi-homing feature, the ability to support multiple network connections in a single end to end association, the transport layer Stream Control Transmission Protocol (SCTP) can enable seamless and transparent communication sessions over multiple heterogeneous networks. This paper analyzes the performance of multimedia distribution when making use of two multihomingSCTPbasedapproaches: Single Path Transfer and Concurrent Multi-path Transfer, in which a single or all paths within an association are used simultaneously for data transmission. In this investigation various retransmission policies and different parameter sets are used in turn and recommendations are made for achieving best results during video delivery. In order to perform this study a novel realistic evaluation tool-set was proposed and is described, which can simulate video delivery over SCTP. Our simulation results and analysis show how to optimize the transmission of multimedia content over SCTP associations in both single and multipath scenarios. INDEX TERMS-Concurrent multi-path transfer, multi-homing, multimedia distribution, SCTP, single path transfer

    Legal Implication of Human and Physical- Activity Monitoring System Using Android Smartphone

    Get PDF
    ABSTRACT: The Project is, primarily, computer code that enables superintendent to watch their human quality portable. All incoming and outgoing calls, texts and multimedia system messages is seen and interrupted by the superintendent, United Nations agency will even monitor where their human area unit (through GPS), access a history of wherever they have been and created hold on if their human area unit going outside of geographical zones, area unit receiving texts from unapproved numbers or calls from illegal persons.That good phone-enabled dead reckoning supports correct however native coordinates of users' trajectories, whereas GPS provides world however inconsistent coordinates. Considering them at the same time, the project device techniques to refine the world positioning results by fitting the worldwide positions to the structure of domestically measured ones, therefore the refined positioning results area unit a lot of seemingly to elicit the bottom truth. The project develop a paradigm system, named GloCal conduct comprehensive experiments in each thronged urban and spacious residential area areas.Our aim is to develop associate economical and improved geographical quality following answer and conserve valuable mobile resources by dynamically adapting the pursuit theme by suggests that of context-aware customized route learning techniques. this technique uses golem based mostly mobile phones for the computer code to be run. The alerts are hold on within the centralized server just like the details of incoming call, text and multimedia messages and conjointly the timely location update of their human. Superintendent could later login into the centralized server and appearance at the most points of their employee mobile usag

    Modelling Cloud Storage

    No full text
    ABSTRACT: Cloud computing is the emerging technology which emphasizes commercial computing. Cloud is a platform providing dynamic resource pools, virtualization & high availability. It's the concept implemented to overcome our regular computing problems like hardware, software, resource availability and related aspects. Cloud computing makes it easy to have high performance computing and storage infrastructure through web services. Infrastructure abstraction is the key that users need not be aware of. As well as proving great scalability, reliability, performance, confidentiality, efficiency and configurability. Cloud computing provides everything on a commercial basis at very low cost compared to dedicated infrastructure. The cloud computing service model involves the provision, by a service provider, of large pools of high performance computing resources and high-capacity storage devices that are shared among end users as required. There are many cloud service models, but generally, end users subscribing to the service have their data hosted by the service, and have computing resources allocated on demand from the pool. This paper gives an idea on cloud storage. Storage is a service and through which user can outsource their data storage requirements to the cloud. It's greatly important to manage the user's large storage requirements. The paper would cover technologies in cloud computing & cloud storage, different cloud computing services and a reference model for cloud storage, its advantages & challenges

    LBMP: A Logarithm-Barrier-Based Multipath Protocol for Internet Traffic Management

    No full text
    ABSTRACT: Traffic management is the adaptation of source rates and routing to efficiently utilize network resources. Recently, the complicated interactions between different Internet traffic management modules have been elegantly modeled by distributed primal dual utility maximization, which sheds new light for developing effective management protocols. For single-path routing with given routes, the dual is a strictly concave network optimization problem. Unfortunately, the general form of multipath utility optimization is not strictly concave, making its solution quite unstable. Decompositionbased technique like TRaffic-management Using Multipath Protocol (TRUMP) alleviates the instability, but their convergence is not guaranteed, nor is their optimality. They are also inflexible in differentiating the control at different links. In this paper, we address the above issues through a novel logarithm-barrier-based approach. Our approach jointly considers user utility and routing/congestion control. It translates the multipath utility maximization into a sequence of unconstrained optimization problems, with infinite logarithm barriers being deployed at the constraint boundary. We demonstrate that setting up barriers is much simpler than choosing traditional cost functions and, more importantly, it makes optimal solution achievable. We further demonstrate a distributed implementation, together with the design of a practical Logarithm Barrierbased-Multipath Protocol (LBMP). We evaluate the performance of LBMP through both numerical analysis and packet-level simulations. The results show that LBMP achieves high throughput and fast convergence over diverse representative network topologies. Such performance is comparable to TRUMP, and is often better. Moreover, LBMP is flexible in differentiating the control at different links, and its optimality and convergence are theoretically guaranteed

    Clustering Uncertain Data Using Voronoi Diagrams and R-Tree Index

    No full text
    ABSTRACT: Clustering uncertain objects has been a topic for research. In this paper the process of clustering uncertain objects and the usage of PDFs (Probability Density Functions) to describe their locations is considered. UKmeans algorithm is not efficient in handling uncertain objects. This paper demonstrates it. The reason for its inefficiency can be traced back to the fact that it computes EDs (Expected Distances) between cluster representatives and objects. It performs numerical integrations for computing EDs which are expensive. In this paper the concept of Voronoi diagrams is proposed to reduce number of ED calculations. When compared with previous bounding-box-based technique, this is more effective and analytically proven. Furthermore this paper proposes building an R-tree index in order to organize uncertain objects. This can effectively reduce overheads pertaining to pruning. The experiments revealed that the techniques used in this paper are additive. Moreover, when used in combination they outperformed earlier methods

    International Journal of Innovative Research in Computer and Communication Engineering Multi Cloud Deployment of Computing Clusters for Loosely Coupled MTC Applications

    No full text
    ABSTRACT: Cloud computing is gaining acceptance in many IT organizations, as an elastic, flexible, and variablecost way to deploy heir service platforms using outsourced resources. Unlike traditional utilities where a single provider scheme is a common practice, the ubiquitous access to cloud resources easily enables the simultaneous use of different clouds. In this paper, we explore this scenario to deploy a computing cluster on the top of a multicloud infrastructure, for solving loosely coupled Many-Task Computing (MTC) applications. In this way, the cluster nodes can be provisioned with resources from different clouds to improve the cost effectiveness of the deployment, or to implement high-availability strategies. We prove the viability of this kind of solutions by evaluating the scalability, performance, and cost of different configurations of a Sun Grid Engine cluster, deployed on a multicloud Infrastructure spanning a local data center and three different cloud sites: Amazon EC2 Europe, Amazon EC2 US, and Elastic Hosts. Although the test bed deployed in this work is limited to a reduced number of computing resources (due to hardware and budget limitations), we have complemented our analysis with a simulated infrastructure model, which includes a larger number of resources ,and runs larger problem sizes. Data obtained by simulation show that performance and cost results can be extrapolated to large-scale problems and cluster infrastructures . Index Terms-Cloud computing, computing cluster, multicloud infrastructure, loosely coupled applications
    corecore